-
1 satisfiable formula
Большой англо-русский и русско-английский словарь > satisfiable formula
-
2 satisfiable formula
Математика: выполнимая формула -
3 satisfiable formula
вчт выполнимая формулаEnglish-Russian electronics dictionary > satisfiable formula
-
4 satisfiable formula
вчт. выполнимая формулаThe New English-Russian Dictionary of Radio-electronics > satisfiable formula
-
5 satisfiable formula
мат. -
6 satisfiable formula
выполнимая формула (булева формула, принимающая значение 1 на некотором наборе 0-1-значений переменных)Англо-русский словарь промышленной и научной лексики > satisfiable formula
-
7 secondarily satisfiable formula
Математика: вторично выполнимая формулаУниверсальный англо-русский словарь > secondarily satisfiable formula
-
8 secondarily satisfiable formula
English-Russian scientific dictionary > secondarily satisfiable formula
-
9 formula
1) рецепт2) формула || формульный3) формулировка•- arithmetically valid formula - back interpolation formula - computational formula - computing formula - corrector formula - formally decidable formula - formally refutable formula - formula of finite increments - geometrically valid formula - homomorphically stable formula - identically false formula - identically true formula - intuitionistically valid formula - logically valid formula - maximum likelihood formula - modally valid formula - monotonically increasing formula - numeralwise expressible formula - numeralwise representable formula - positively valid formula - primitively recursive formula - reciprocity formula - secondarily valid formula - square stable formula - universally valid formulato follow the formula — подчиняться [следовать] формуле; описываться формулой
-
10 satisfiable
выполнимый jointly satisfiable formulas ≈ совместно выполнимые формулы secondarily satisfiable formula ≈ вторично выполнимая формула - finitely satisfiable - jointly satisfiable - satisfiable formula - satisfiable sentence - satisfiable statement - secondary satisfiable удовлетворимый (логика) выполнимыйБольшой англо-русский и русско-английский словарь > satisfiable
-
11 formula
а) формулировка- Bayes formula
- Bayesian formula
- Bethe-Salpeter formula
- Cauchy formula
- Cauchy dispersion formula
- Cayley formula
- dispersion formula
- Erlang formula
- Erlangian formula
- external reference formula
- invariant under stuttering formula
- Moivre formula
- molecular formula
- Nyquist formula
- Parseval's formula
- predicate formula
- Sabine formula
- satisfiable formula
- Shockley-Read formula
- Steinmetz formula
- Stirling's formula
- string formula
- structural formula
- syntactically monotone formula -
12 formula
а) формулировка•- Bayes formula
- Bayesian formula
- Bethe-Salpeter formula
- Cauchy dispersion formula
- Cauchy formula
- Cayley formula
- dispersion formula
- Erlang formula
- Erlangian formula
- external reference formula
- invariant under stuttering formula
- Moivre formula
- molecular formula
- Nyquist formula
- Parseval's formula
- predicate formula
- Sabine formula
- satisfiable formula
- Shockley-Read formula
- Steinmetz formula
- Stirling's formula
- string formula
- structural formula
- syntactically monotone formulaThe New English-Russian Dictionary of Radio-electronics > formula
-
13 выполнимая формула
satisfiable formula вчт.Русско-английский словарь по электронике > выполнимая формула
-
14 выполнимая формула
satisfiable formula вчт.Русско-английский словарь по радиоэлектронике > выполнимая формула
-
15 выполнимая формула
satisfiable formula мат.Русско-английский научно-технический словарь Масловского > выполнимая формула
-
16 вторично выполнимая формула
secondarily satisfiable formula, secondarily satisfiable satisfiableРусско-английский научно-технический словарь Масловского > вторично выполнимая формула
-
17 выполнимая формула
Большой англо-русский и русско-английский словарь > выполнимая формула
-
18 вторично выполнимая формула
Mathematics: secondarily satisfiable formulaУниверсальный русско-английский словарь > вторично выполнимая формула
-
19 выполнимая формула
Mathematics: satisfiable formulaУниверсальный русско-английский словарь > выполнимая формула
См. также в других словарях:
Resolution (logic) — In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a refutation theorem proving technique for sentences in propositional logic and first order logic. In other words, iteratively applying the… … Wikipedia
S5 (modal logic) — In logic and philosophy, S5 is one of five systems of modal logic proposed by Clarence Irving Lewis and Cooper Harold Langford in their 1932 book Symbolic Logic . It is a normal modal logic, and one of the oldest systems of modal logic of any… … Wikipedia
Existential graph — An existential graph is a type of diagrammatic or visual notation for logical expressions, proposed by Charles Sanders Peirce, who wrote his first paper on graphical logic in 1882 and continued to develop the method until his death in 1914.The… … Wikipedia
Entitative graph — An entitative graph is an element of the graphical syntax for logic that Charles Sanders Peirce developed under the name of qualitative logic beginning in the 1880 s, taking the coverage of the formalism only as far as the propositional or… … Wikipedia
Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… … Wikipedia
Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Skolem normal form — A formula of first order logic is in Skolem normal form (named after Thoralf Skolem) if it is in conjunctive prenex normal form with only universal first order quantifiers. Every first order formula can be converted into Skolem normal form while… … Wikipedia
Valiant-Vazirani theorem — The Valiant Vazirani Theorem was proven by Leslie Valiant and Vijay Vazirani in their paper titled NP is as easy as detecting unique solutions published in 1986. The theorem states that if there is a polynomial time algorithm for UNIQUE SAT, then … Wikipedia
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … Wikipedia